#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, m;
int a[N];

int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  rep(i, 1, n) cin >> a[i];
  sort(a + 1, a + n + 1);
  int ans = 0;
  int l = 1;
  while (l <= n) {
    int h = l + 1;
    while (h <= n && a[h] == a[l]) h++;
    int now = h - l;
    ans += max(0, now - ans);
    l = h;
  }
  cout << ans;
  return 0;
}